Adaptive matrix distances aiming at optimum regression subspaces
نویسندگان
چکیده
Abstract. A new supervised adaptive metric approach is introduced for mapping an input vector space to a plottable low-dimensional subspace in which the pairwise distances are in maximum correlation with distances of the associated target space. The formalism of multivariate subspace regression (MSR) is based on cost function optimization, and it allows assessing the relevance of input vector attributes. An application to molecular descriptors in a chemical compound data base is presented for targeting octanol-water partitioning properties.
منابع مشابه
On the efficiency of two-stage response-adaptive designs.
In this paper, we investigate the efficiency of response-adaptive locally optimum designs. We focus on two-stage adaptive designs, where after the first stage the accrued data are used to determine a locally optimum design for the second stage. On the basis of an explicit expansion of the information matrix, we compare the variance of the maximum likelihood estimates obtained from a two-stage a...
متن کاملAssessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
The optimum and at least one optimizing point for convex nonlinear programs can be approximated well by the solution to a linear program (a fact long used in branch and bound algorithms). In more general problems, we can identify subspaces of “nonconvex variables” such that, if these variables have sufficiently small ranges, the optimum and at least one optimizing point can be approximated well...
متن کاملSchubert Varieties and Distances between Subspaces of Different Dimensions
We resolve a basic problem on subspace distances that often arises in applications: How can the usual Grassmann distance between equidimensional subspaces be extended to subspaces of different dimensions? We show that a natural solution is given by the distance of a point to a Schubert variety within the Grassmannian. This distance reduces to the Grassmann distance when the subspaces are equidi...
متن کاملAdaptive Matrix Metrics for Attribute Dependence Analysis in Differential High-throughput Data
Data-driven metric adaptation is proposed for proteome analysis of 2D-gel electrophoretic plots aiming at identification of stress related proteins in two barley cultivars with different response towards different salt stress conditions. Gradient descent is applied to the ratio of intraand inter-class distance sums to optimize the matrix parameters of generalized Mahalanobis distances in order ...
متن کاملHard-LOST: Modified k-Means for Oriented Lines
Robust clustering of data into linear subspaces is a common problem. Here we treat clustering into one-dimensional subspaces that cross the origin. This problem arises in blind source separation, where the subspaces correspond directly to columns of a mixing matrix. We present an algorithm that identifies these subspaces using a modified k-means procedure, where line orientations and distances ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010